On the characteristic polynomial of Laplacian Matrices of Caterpillars

摘要

The characteristic polynomials of the adjacency matrix of line graphs ofcaterpillars and then the characteristic polynomials of their Laplacian orsignless Laplacian matrices are characterized, using recursive formulas.Furthermore, the obtained results are applied on the determination of upper andlower bounds on the algebraic connectivity of these graphs.